Program Verification by Reduction to Semi-algebraic Systems Solving
نویسندگان
چکیده
The discovery of invariants and ranking functions plays a central role in program verification. In our previous work, we investigated invariant generation and non-linear ranking function discovering of polynomial programs by reduction to semi-algebraic systems solving. In this paper we will first summarize our results on the two topics and then show how to generalize the approach to discovering more expressive invariants and ranking functions, and applying to more general programs. keywords Program Verification, Ranking Functions, Invariants, Polynomial Programs, Semi-Algebraic Systems, Quantifier Elimination
منابع مشابه
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the symbolic computation tools, DISCOVERER and QEPCAD, to some interesting examples. keywords: Program Verification, Loop Termination, Ranking Function, Polynomial Programs, Semi-Algebraic Systems, Computer Algebra, DISCOVERER, QEPCAD
متن کاملProgram Verification by Using DISCOVERER
Recent advances in program verification indicate that various verification problems can be reduced to semi-algebraic system (SAS for short) solving. An SAS consists of polynomial equations and polynomial inequalities. Algorithms for quantifier elimination of real closed fields are the general method for those problems. But the general method usually have low efficiency for specific problems. To...
متن کاملGenerating Polynomial Invariants with DISCOVERER and QEPCAD
This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invariants represented as a semialgebraic system are more expressive than those generated with the wellestablished approaches in the literature, which are normally represented as a conjunction of polynomial equations. We implement t...
متن کاملA Semi-Algebraic Approach for the Computation of Lyapunov Functions
In this paper we deal with the problem of computing Lyapunov functions for stability verification of differential systems. We concern on symbolic methods and start the discussion with a classical quantifier elimination model for computing Lyapunov functions in a given polynomial form, especially in quadratic forms. Then we propose a new semi-algebraic method by making advantage of the local pro...
متن کاملAlgebraic Solving of Complex Interval Linear Systems by Limiting Factors
In this work, we propose a simple method for obtaining the algebraic solution of a complex interval linear system where coefficient matrix is a complex matrix and the right-hand-side vector is a complex interval vector. We first use a complex interval version of the Doolittle decomposition method and then we restrict the Doolittle's solution, by complex limiting factors, to achieve a complex in...
متن کامل